On a robustness property in single-facility location in continuous space
نویسندگان
چکیده
We consider a single–facility location problem in continuous space, here the problem of minimizing a sum or the maximum of the possibly weighted distances from a facility to a set of points of demand. The main result of this paper shows that every solution (optimal facility location) of this problem has an interesting robustness property. Any optimal facility location is the most robust in the following sense: given a suitable highest admissible cost, it allows the greatest perturbation of the locations of the demand without exceeding this highest admissible chosen cost.
منابع مشابه
A multiobjective continuous covering location model
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملSingle Facility Goal Location Problems with Symmetric and Asymmetric Penalty Functions
Location theory is an interstice field of optimization and operations research. In the classic location models, the goal is finding the location of one or more facilities such that some criteria such as transportation cost, the sum of distances passed by clients, total service time, and cost of servicing are minimized. The goal Weber location problem is a special case of location mode...
متن کاملSolving single facility goal Weber location problem using stochastic optimization methods
Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کامل